Stable trace automata vs. full trace automata
نویسندگان
چکیده
منابع مشابه
8 Trace Only Automata 179 Trace Assertion
The trace assertion method is a formal state machine based method for specifying module A module interface speciication treats the module as a black-box, identifying all module's access programs (i.e. programs that can be invoked from outside of the module), and describing their externally visible eeects. A formal model for the trace assertion method is proposed. The concept of step-traces is i...
متن کاملWeighted and Unweighted Trace Automata
We reprove Droste & Gastin’s characterisation from [3] of the behaviors of weighted trace automata by certain rational expressions. This proof shows how to derive their result on weighted trace automata as a corollary to the unweighted counterpart shown by Ochmański.
متن کاملTrace Expressiveness of Timed and Probabilistic Automata
Automata expressiveness is an essential feature in understanding which of the formalisms available should be chosen for modelling a particular problem. Probabilistic and stochastic automata are suitable for modelling systems exhibiting probabilistic behaviour and their expressiveness has been studied relative to non-probabilistic transition systems and Markov chains. In this paper, we consider ...
متن کاملTrace Complexity of Chaotic Reversible Cellular Automata
Delvenne, Kůrka and Blondel have defined new notions of computational complexity for arbitrary symbolic systems, and shown examples of effective systems that are computationally universal in this sense. The notion is defined in terms of the trace function of the system, and aims to capture its dynamics. We present a Devaney-chaotic reversible cellular automaton that is universal in their sense,...
متن کاملSimulating I/o Automata. Trace Properties
I/O automaton is a mathematical model used for synchronous distributed algorithms. I/O automaton is a state machine with very little structure, and with labeled transitions. IOA language was developed for this automata. This article presents the building of a simulator for I/O automata described in a dialect of this language. The use of the simulator is to generate traces of the automata, so th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1998
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(97)00299-5